Table Representations of Granulations Revisited Pre-topological Information Tables

نویسندگان

  • I-Jen Chiang
  • Tsau Young Lin
  • Yong Liu
چکیده

This paper examines the knowledge representation theory of granulations. The key strengths of rough set theory are its capabilities in representing and processing knowledge in table format. For general granulation such capabilities are unknown. For single level granulation, two initial theories have been proposed previously by one of the authors. In this paper, the theories are re-visited, a new and deeper analysis is presented: Granular information table is an incomplete representation, so computing with words is the main method of knowledge processing. However for symmetrical granulation, the pre-topological information table is a complete representation, so the knowledge processing can be formal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Granular Computing and Rough Sets - An Incremental Development

Granulation and partition are examined in parallel from the rough set prospect. The table representations and concept hierarchy tree for partitions are set theoretical, but become topological for granulations. Here topology means the binary neighborhood system pre-topology defined by binary relations.

متن کامل

On the Mark and Markaracter Tables of Finite Groups

Let G be a finite group and C(G) be the family of representative conjugacy classes of‎ ‎subgroups of G‎. ‎The matrix whose H,K-entry is the number of ‎fixed points of the set G/K under the action of H is called the‎ ‎table of marks of G where H,K run through all elements in‎ C(G)‎. Shinsaku Fujita for the first time introduced the term “markaracter” to discuss marks for permutation representati...

متن کامل

Budan tables of real univariate polynomials

The Budan table of f collects the signs of the iterated derivatives of f . We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connectivity property of its Budan table. We use this property to characterize the virtual roots of f (introduced by Gonzalez-Vega, Lombardi, Mahé in 1998); they are continuous functions of the coefficients of f . We als...

متن کامل

Ad Hoc Table Retrieval using Semantic Similarity

We introduce and address the problem of ad hoc table retrieval: answering a keyword query with a ranked list of tables. This task is not only interesting on its own account, but is also being used as a core component in many other table-based information access scenarios, such as table completion or table mining. The main novel contribution of this work is a method for performing semantic match...

متن کامل

Start Small, Build Complete: Effective and Efficient Semantic Table Interpretation using TableMiner

This article introduces TableMiner, the first semantic Table Interpretation method able to annotate Web tables using an incremental, bootstrapping learning approach seeded by automatically selected ‘partial’ content from tables. The basic principle is to create initial and partial annotations of a table using some as opposed to all content in the table. The partial outcome then serves as ‘stepp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005